Method, computer system, and physical computer storage medium for organizing data into data structures

ABSTRACT

Methods, computer systems, and physical computer storage medium for organizing data are provided. A method includes monitoring usage of the data, detecting a pattern in the usage of the data, and assigning a first concrete implementation associated with a first data structure to the data, based, in part, on the detected pattern of usage of the data. The method also includes identifying a change in the pattern of usage of the data, after the step of assigning and switching the first concrete implementation associated with the first data structure to a second concrete implementation, based, in part, on the change in the pattern of usage.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates in general to methods, computer systems,and physical computer storage media comprising a computer programproduct for organizing data into data structures.

2. Description of the Related Art

Computer software, or simply software, is a general term used todescribe a collection of computer programs, procedures, anddocumentation that perform tasks in a computing environment. Computersoftware is generally stored on a computer data storage system, andcomputer data storage in the system is used by the software for avariety of purposes. For example, a file including information may bestored in a data storage system, and computer software may useinformation contained in the file.

Different types of computer software are developed to operate a computersystem. For instance, system software, such as operating systems,interface with hardware to provide the necessary services forapplication software, middleware controls and coordinates distributedsystems, and application software, such as word processors, performproductive tasks for users.

In the case of user interactive computer software such as applicationsoftware, developers typically design the application according to aperception of how the user may interact with the application. Forcollection data type applications, such as List in Java, the developerpredicts an expected usage by the user of the collected data. Thedeveloper then chooses a data structure for the expected usage anddevelops code (i.e., a concrete implementation) to implementfunctionality according to the chosen data structure.

In one example, LogRecords from a logfile are sorted by time stamp andthus, a list used to store the LogRecords is sorted by time stamp. Thedeveloper predicts that when the user wants to retrieve a particularentry from the list, the user will specify a time range to viewincluding the time stamp of the particular entry. Accordingly, thedeveloper organizes the list into a linked list data structure, an arraybacked list data structure or another type of data structure. Typically,the code organizing the list into the data structure is written suchthat the data structure is static.

SUMMARY OF THE INVENTION

Although the aforementioned known types of data structures provideadequate data retrieval performance, the method by which data isstructured can be improved. For example, linked list data structures areuseful for initial organization of data. However, entries organizedwithin the linked lists may be difficult to search and randomly access.In contrast, array backed list data structures are relatively easy tosearch and randomly access; however, such data structures may not beeasily initiated. Because the structure into which the entries is to beorganized is pre-determined before the user uses the data, systemperformance may not be optimized.

Accordingly, there is a need for a method of organizing data that isrelatively easier to use than conventional data organization systemsand/or structures. Moreover, it is desirable to have a method oforganizing data that can be used to initialize data and/or provideimproved searching and/or random access of the data if desired by theuser. Additionally, it is desirable for the list implementation bedynamic such that actual usage of the data determines which datastructure should be implemented to thereby improve performance of theorganization under varied usage conditions.

The present invention provides an improved method for organizing data.In an embodiment, by way of example only, the method includes monitoringusage of the data, detecting a pattern in the usage of the data, andassigning a first concrete implementation associated with a first datastructure to the data, based, in part, on the detected pattern of usageof the data.

The present invention further provides a computer system for organizingdata. In an embodiment, by way of example only, the computer systemincludes an application programming interface (API), a usage recordingcomponent, an implementation switching component, and a concreteimplementation component. The API is configured to define a plurality ofoperations to be performed on data to make up a usage of the data. Theusage recording component is configured to record the operationsperformed on the data. The implementation switching component isconfigured to monitor usage of the data to detect a pattern of usage, toretrieve a first set of conditions under which a corresponding concreteimplementation becomes active, to determine whether the first set ofconditions are met by the pattern of usage of the data, and to assignthe corresponding concrete implementation associated with a datastructure, if the first set or conditions are met. The concreteimplementation component is configured to execute the operations in theAPI in accordance with the corresponding concrete implementationassociated with the data structure.

In another embodiment, by way of example only, the present inventionfurther provides a physical computer storage medium comprising acomputer program product method for organizing data. The physicalcomputer storage medium includes computer code for monitoring usage ofdata, computer code for detecting a pattern in the usage of the data,and computer code for assigning a first concrete implementationassociate with a data structure, based, in part, on the detected patternof usage of the data.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsthat are illustrated in the appended drawings. Understanding that thesedrawings depict only typical embodiments of the invention and are nottherefore to be considered to be limiting of its scope, the inventionwill be described and explained with additional specificity and detailthrough the use of the accompanying drawings, in which:

FIG. 1 is a block diagram showing one embodiment of a data storagesystem according to an embodiment;

FIG. 2 is a schematic of a computer system for organizing data into datastructures, according to an embodiment; and

FIG. 3 a flow diagram of a method for organizing data into datastructures, according to an embodiment.

DETAILED DESCRIPTION OF THE DRAWINGS

Methods, computer systems, and physical computer storage media have nowbeen provided that are configured to dynamically organize data into datastructures by evaluating actual usage of the data by a user. The methodsby which the computer systems operate and that are embodied by thephysical computer storage media can be used to initialize data and/orprovide improved searching and/or random access of the data if desiredby the user. The method generally includes monitoring usage of the data,detecting a pattern in the usage of the data, and assigning a firstconcrete implementation associated with a first data structure to thedata, based, in part, on the detected pattern of usage of the data, andcan be performed using any one of numerous types of computer systems.

In the illustrated embodiment of FIG. 1, data storage system 100 canperform the method of the present invention. Data storage system 100comprises storage controller 120 and data storage media 130, 140, 150,and 160. Storage controller 120 communicates with data storage media130, 140, 150, and 160, via I/O protocols 132, 142, 152, and 162,respectively. I/O protocols 132, 142, 152, and 162, may comprise anysort of I/O protocol, including without limitation a fiber channel loop,SCSI (Small Computer System Interface), iSCSI (Internet SCSI), SAS(Serial Attach SCSI), Fiber Channel, SCSI over Fiber Channel, Ethernet,Fiber Channel over Ethernet, Infiniband, and SATA (Serial ATA).

The term “physical computer storage medium” is defined herein as a datastorage medium in combination with the hardware, firmware, and/orsoftware, needed to write information to, and read information from,that data storage medium. In certain embodiments, the physical computerstorage medium comprises a magnetic data storage medium, such as andwithout limitation a magnetic disk, magnetic tape, and the like. Incertain embodiments, the physical computer storage medium comprises anoptical data storage medium, such as and without limitation a CD, DVD(Digital Versatile Disk), HD-DVD (High Definition DVD), BD (Blue-RayDisk) and the like. In certain embodiments, the physical computerstorage medium comprises an electronic data storage medium, such as andwithout limitation a PROM, EPROM, EEPROM, Flash PROM, compact flash,smartmedia, and the like. In certain embodiments, the physical computerstorage medium comprises a holographic data storage medium.

Storage controller 120 is in communication with host computers 170, 180,and 190. As a general matter, host computers 170, 180, and 190, eachcomprises a computer system, such as a mainframe, personal computer,workstation, and combinations thereof, including an operating systemsuch as Windows®, AIX®, Unix®, MVS®, LINUX®, etc. (Windows is aregistered trademark of Microsoft Corporation; AIX is a registeredtrademark and MVS is a trademark of IBM Corporation; UNIX is aregistered trademark in the United States and other countries licensedexclusively through The Open Group; and LINUX is a registered trademarkof Linus Torvald). In certain embodiments, one or more of host computers170, 180, and/or 190, further includes a storage management module 172,182, 192, respectively. In certain embodiments, storage managementmodules 172, 182, and 192, may include the functionality of storagemanagement type programs known in the art that manage the transfer ofdata to and from a data storage and retrieval system, such as forexample and without limitation the IBM DFSMS implemented in the IBM MVSoperating system.

Storage management modules 172, 182, and 192 may be implemented as ahardware circuit comprising custom VLSI circuits or gate arrays,off-the-shelf semiconductors such as logic chips, transistors, or otherdiscrete components. Storage management modules 172, 182, and 192 mayalso be implemented in programmable hardware devices such as fieldprogrammable gate arrays, programmable array logic, programmable logicdevices, or the like.

Storage management modules 172, 182, and 192 may also be implemented insoftware for execution by various types of processors. An identifiedmodule of executable code may, for instance, comprise one or morephysical or logical blocks of computer instructions which may, forinstance, be organized as an object, procedure, or function.Nevertheless, the executables of an identified storage management moduleneed not be physically collocated, but may comprise disparateinstructions stored in different locations which, when joined logicallytogether, comprise the module and achieve the stated purpose for themodule

A module of executable code may be a single instruction, or manyinstructions, and may even be distributed over several different codesegments, among different programs, and across several memory devices.Similarly, operational data may be identified and illustrated hereinwithin modules, and may be embodied in any suitable form and organizedwithin any suitable type of data structure. The operational data may becollected as a single data set, or may be distributed over differentlocations including over different storage devices, and may exist, atleast partially, merely as electronic signals on a system or network.

Storage controller 120 comprises processor 128, computer readable medium121, microcode 122 written to computer readable medium 121, andinstructions 124 written to computer readable medium 121. Processor 128utilizes microcode 122 to operate storage controller 120. Host computers170, 180, and 190, are connected to fabric 110 utilizing I/O protocols103, 105, and 107, respectively. I/O protocols 103, 105, and 107, may beany type of I/O protocol; for example, a Fiber Channel (“FC”) loop, adirect attachment to fabric 110 or one or more signal lines used by hostcomputers 170, 180, and 190, to transfer information to and from fabric110.

Fabric 110 includes, for example, one or more FC switches 115. Those oneor more switches 115 comprise one or more conventional router switches.One or more switches 115 interconnect host computers 170, 180, and 190,to storage controller 120 via I/O protocol 117. I/O protocol 117 maycomprise any type of I/O interface, for example, a Fiber Channel,Infiniband, Gigabit Ethernet, Ethernet, TCP/IP, iSCSI, SCSI I/Ointerface or one or more signal lines used by FC switch 115 to transferinformation through to and from storage controller 120, and subsequentlydata storage media 130, 140, 150, and 160. In other embodiments, one ormore host computers, such as for example and without limitation hostcomputers 170, 180, and 190, communicate directly with storagecontroller 120 using I/O protocols 103, 105, and 107, respectively.

As noted above, storage management modules 172, 182, and 192, areutilized to store and delete data sets on a physical computer storagemedium and can comprise executable code or operational data that isorganized within any suitable type of data structure. To manage datadynamically according to the present invention, a computer system 200 isincluded for operating the data storage system 100. A schematic of acomputer system 200 is illustrated in FIG. 2, according to anembodiment. Computer system 200, made up of software, includes anapplication programming interface (API) 210, a usage recording component220, an implementation switching component 230, and concreteimplementation component 240. The API 210 is configured to define aplurality of operations to be performed on data to make up a usage ofthe data. The operations defined by the API 210 include, but are notlimited to operations that are performed on a data structure, includingbut not limited to well-known functions such as enqueue on a Queue, pushon a Stack, and getParent on TreeNode. Each operation performed on thedata comprises a usage event, and a plurality of usage events provides ausage of the data. To provide an interface to a user, the API 210 isfurther configured to be receive functions calls from other parts of thesoftware of the computer system 200 are able to make function calls tothe functions that comprise the API.

The API 210 communicates with the usage recording component 220. In anembodiment, the API 210 communicates with the usage recording component220 via shared memory, registers, buses and the like. The usagerecording component 220 is configured to record the operations performedon the data by the user via the API 210. In certain embodiments, theusage recording component 220 records add and/or remove events. In otherembodiments, the usage recording component 220 tracks operationsperformed on the API 210. In still other embodiments, the usagerecording component 220 is configured to track composite data from theoperations performed on the data. For example, the composite data cancomprise a total number of events making up the operations performed onthe data, a frequency of one or more events occurring among theoperations performed on the data and/or a ratio of occurrences betweenselected events. In any case, a record of the collected recordedoperations is used in a determination as to which data structure is tobe assigned to the recorded operations.

The implementation switching component 230 is configured to monitorusage of the data to detect a pattern of usage. Additionally, theimplementation switching component 230 retrieves a first set ofconditions under which a corresponding concrete implementation becomesactive to determine whether the first set of conditions are met by thepattern of usage of the data. If the first set of conditions is met, theimplementation switching component 230 assigns the correspondingconcrete implementation associated with a data structure. It will beappreciated that logic is used to determine if the first set ofconditions is met. In another embodiment, the implementation switchingcomponent 230 is further configured to identify a change in the patternof usage and to switch the corresponding concrete implementationassociated with the data structure to another concrete implementation,based, in part on the change in the pattern of usage.

The concrete implementation component 240 communicates with theimplementation switching component 230. The concrete implementationcomponent 240 implements logic for importing data from another concreteimplementation and logic to execute operations in the API 210.Specifically, the concrete implementation component 240 is configured toexecute the operations in the API 210 in accordance with thecorresponding concrete implementation associated with the data structureassigned by the implementation switching component 230. For example, theconcrete implementation component 240 is further configured to importdata from the corresponding concrete implementation associated with thedata structure and transforming the imported data into a localimplementation.

In an embodiment in which the implementation switching component 230detects a change in the pattern of usage of the data and activates a newconcrete implementation, the concrete implementation component 240 canbe configured to import data from the previously-active concreteimplementation and to transform the retrieved data into the new concreteimplementation. As data is imported and transformed, thepreviously-active concrete implementation remains active and API callscontinue to be routed thereto. However, after the data import iscompleted, the new concrete implementation and subsequent API calls arethen routed to the new concrete implementation. In another embodiment,data import and routing API calls to the new concrete implementation canoccur simultaneously.

FIG. 3 is a flowchart of a method 300 for organizing data into datastructures, according to an embodiment. Generally, the method 300 beginsby monitoring usage of the data to be organized into data structures,step 310. Step 310 is performed by the usage recording component 220(FIG. 2), in an embodiment. According to an embodiment, step 310includes recording a first plurality of operations performed on thedata. Additionally, step 310 can include tracking composite data basedon analyzing the plurality of operations. The composite data comprises atotal number of occurrences of a first event within the plurality ofoperations, a ratio of occurrences between a first event and a secondevent within the plurality of operations or another type of compositedata of interest to the user.

A pattern in the usage of the data is detected, step 320. Next, a firstconcrete implementation associated with a first data structure isassigned to the data, based, in part, on the detected pattern of usageof the data, step 330. In particular, to identify which data structureshould be assigned to the data monitored in steps 310 and 320, a firstset of conditions under which the first concrete implementation isactivated is retrieved. Then, a determination is made as to whether thedetected pattern of usage meets the first set of conditions, and thefirst concrete implementation is assigned to the first data structure,if the first set of conditions is met. Steps 320 and 330 are performedby the implementation switching component 230 (FIG. 2).

If a change in the pattern of usage of the data is identified, after thestep of assigning (e.g., step 330), step 340, the first concreteimplementation associated with the first data structure is switched to asecond concrete implementation, based, in part, on the change in thepattern of usage, step 350. As used herein, the term “second concreteimplementation” is defined as a concrete implementation of a datastructure that is different from that of the first concreteimplementation. During step 340, the data associated with the firstconcrete implementation associated with the first data structure isimported and transformed into a local implementation, in an embodiment.Calls can be routed to the first concrete implementation during step340. During step 350, calls can be routed to the second concreteimplementation.

While at least one exemplary embodiment has been presented in theforegoing detailed description of the invention, it should beappreciated that a vast number of variations exist. It should also beappreciated that the exemplary embodiment or exemplary embodiments areonly examples, and are not intended to limit the scope, applicability,or configuration of the invention in any way. Rather, the foregoingdetailed description will provide those skilled in the art with aconvenient road map for implementing an exemplary embodiment of theinvention, it being understood that various changes may be made in thefunction and arrangement of elements described in an exemplaryembodiment without departing from the scope of the invention as setforth in the appended claims and their legal equivalents.

As will be appreciated by one of ordinary skill in the art, aspects ofthe present invention may be embodied as a system, method, or computerprogram product. Accordingly, aspects of the present invention may takethe form of an entirely hardware embodiment, an entirely softwareembodiment (including firmware, resident software, micro-code, etc.) oran embodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module,” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer-readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer-readable medium(s) may beutilized. The computer-readable medium may be a computer-readable signalmedium or a physical computer-readable storage medium. A physicalcomputer readable storage medium may be, for example, but not limitedto, an electronic, magnetic, optical, crystal, polymer, electromagnetic,infrared, or semiconductor system, apparatus, or device, or any suitablecombination of the foregoing. Examples of a physical computer-readablestorage medium include, but are not limited to, an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk,RAM, ROM, an EPROM, a Flash memory, an optical fiber, a CD-ROM, anoptical storage device, a magnetic storage device, or any suitablecombination of the foregoing. In the context of this document, acomputer-readable storage medium may be any tangible medium that cancontain, or store a program or data for use by or in connection with aninstruction execution system, apparatus, or device.

Computer code embodied on a computer-readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wired, optical fiber cable, radio frequency (RF), etc., or any suitablecombination of the foregoing. Computer code for carrying out operationsfor aspects of the present invention may be written in any staticlanguage, such as the “C” programming language or other similarprogramming language. The computer code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, or communication system, including, but notlimited to, a local area network (LAN) or a wide area network (WAN),Converged Network, or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described above with reference toflow diagrams and/or block diagrams of methods, apparatus (systems) andcomputer program products according to embodiments of the invention. Itwill be understood that each block of the flow diagrams and/or blockdiagrams, and combinations of blocks in the flow diagrams and/or blockdiagrams, can be implemented by computer program instructions. Thesecomputer program instructions may be provided to a processor of ageneral purpose computer, special purpose computer, or otherprogrammable data processing apparatus to produce a machine, such thatthe instructions, which execute via the processor of the computer orother programmable data processing apparatus, create means forimplementing the functions/acts specified in the flow diagram and/orblock diagram block or blocks.

These computer program instructions may also be stored in acomputer-readable medium that can direct a computer, other programmabledata processing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer-readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flow diagram and/or blockdiagram block or blocks. The computer program instructions may also beloaded onto a computer, other programmable data processing apparatus, orother devices to cause a series of operational steps to be performed onthe computer, other programmable apparatus or other devices to produce acomputer implemented process such that the instructions which execute onthe computer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flow diagram and/orblock diagram block or blocks.

The flow diagrams and block diagrams in the above figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflow diagrams or block diagrams may represent a module, segment, orportion of code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flow diagrams, andcombinations of blocks in the block diagrams and/or flow diagram, can beimplemented by special purpose hardware-based systems that perform thespecified functions or acts, or combinations of special purpose hardwareand computer instructions.

While one or more embodiments of the present invention have beenillustrated in detail, one of ordinary skill in the art will appreciatethat modifications and adaptations to those embodiments may be madewithout departing from the scope of the present invention as set forthin the following claims.

What is claimed is:
 1. A method for organizing data into datastructures, the method comprising: monitoring usage of the data using aprocessing device; detecting a pattern in the usage of the data usingthe processing device, the pattern of usage based on a plurality of dataremove events and data add events; assigning a first concreteimplementation associated with a first data structure to the data,based, in part, on the detected pattern of usage of the data using theprocessing device; identifying a change in the pattern of usage of thedata using the processing device, after the step of assigning;switching, using the processing device, the first concreteimplementation associated with the first data structure to a secondconcrete implementation, based, in part, on the change in the pattern ofusage, the second concrete implementation associated with a second datastructure that is different from the first data structure; importingdata from the first concrete implementation and transforming theimported data into the second concrete implementation using theprocessing device; and continuing to route calls to the first concreteimplementation during the importing with the processing device.
 2. Themethod of claim 1, wherein: the step of monitoring comprises recording afirst plurality of operations performed on the data, before the step ofdetecting; and the step of detecting further comprises detecting thepattern, based, in part, on the recorded first plurality of operations.3. The method of claim 2, wherein the step of recording furthercomprises tracking composite data based on analyzing the plurality ofoperations.
 4. The method of claim 3, wherein the composite datacomprises a total number of occurrences of a first event within theplurality of operations.
 5. The method of claim 3, wherein the compositedata comprises a ratio of occurrences between a first event and a secondevent within the plurality of operations.
 6. The method of claim 1,further comprising importing the data associated with the first concreteimplementation associated with the first data structure and transformingthe imported data into a local implementation, before the step ofswitching.
 7. The method of claim 6, wherein the step of switchingcomprises routing calls to the second concrete implementation after thestep of importing.
 8. The method of claim 1, further comprising:retrieving a first set of conditions under which the first concreteimplementation is activated, after the step of detecting; determiningwhether the detected pattern of usage meets the first set of conditions;and assigning the first concrete implementation to the first datastructure, if the first set of conditions are met.
 9. The method ofclaim 1, wherein the pattern is based on one of: a total number of addevents, a total number of remove events, or a total number of add andremove events; a frequency of add events, a frequency of remove events,or a frequency of add and remove events; and a ratio of occurrencebetween add and remove events.
 10. The method of claim 1, wherein thepattern is based on two of: a total number of add events, a total numberof remove events, or a total number of add and remove events; afrequency of add events, a frequency of remove events, or a frequency ofadd and remove events; and a ratio of occurrence between add and removeevents.
 11. The method of claim 1, wherein the pattern is based on eachof: a total number of add events, a total number of remove events, or atotal number of add and remove events; a frequency of add events, afrequency of remove events, or a frequency of add and remove events; anda ratio of occurrence between add and remove events.
 12. A computersystem comprising: a memory device; and a processing device coupled tothe memory device, the processing device executing: an applicationperformance interface (API) configured to define a plurality ofoperations to be performed on data to make up a usage of the data; ausage recording component configured to record the operations performedon the data; an implementation switching component configured to monitorusage of the data to detect a pattern of usage based on a plurality ofdata remove events and data add events, to retrieve a first set ofconditions under which a corresponding first concrete implementationbecomes active, to determine whether the first set of conditions are metby the pattern of usage of the data, to assign the first concreteimplementation associated with a first data structure, if the first setof conditions are met, to identify a change in the pattern of usage ofthe data, after assigning, and to switch the first concreteimplementation associated with the first data structure to a secondconcrete implementation, based, in part, on the change in the pattern ofusage, the second concrete implementation associated with a second datastructure that is different from the first data structure; and aconcrete implementation component configured to execute the operationsin the API in accordance with the first concrete implementationassociated with the first data structure, to import data from the firstconcrete implementation and to transform the imported data into thesecond concrete implementation, and to continue to route calls to thefirst concrete implementation during the importing.
 13. The computersystem of claim 12, wherein the API is further configured to be visibleto a user.
 14. The computer system of claim 12, wherein the usagerecording component is further configured to record add events andremove events.
 15. The computer system of claim 12, wherein the usagerecording component is further configured to track composite datacomprising events making up the operations performed on the data. 16.The computer system of claim 12, wherein the concrete implementationcomponent is further configured to import data from the first concreteimplementation associated with the first data structure and to transformthe imported data into a local implementation.
 17. A non-transitoryphysical computer storage medium comprising a computer program productmethod for organizing data, the physical computer storage mediumcomprising: computer code for monitoring usage of data; computer codefor detecting a pattern in the usage of the data, the pattern of usagebased on a plurality of data remove events and data add events; computercode for assigning a first concrete implementation associate with a datastructure, based, in part, on the detected pattern of usage of the data;computer code for identifying a change in the pattern of usage of thedata, after the assigning; computer code for switching the firstconcrete implementation associated with the first data structure to asecond concrete implementation, based, in part, on the change in thepattern of usage, the second concrete implementation associated with asecond data structure that is different from the first data structure;computer code for importing data from the first concrete implementationand transforming the imported data into the second concreteimplementation; and computer code for continuing to route calls to thefirst concrete implementation during the importing.
 18. The physicalcomputer storage medium of claim 17, further comprising: computer codefor recording a first plurality of operations performed on the data; andcomputer code for detecting the pattern, based, in part, on the recordedfirst plurality of operations.
 19. The physical computer storage mediumof claim 17, further comprising: computer code for retrieving a firstset of conditions under which the first concrete implementation isactivated; computer code for determining whether the detected pattern ofusage meets the first set of conditions; and computer code for assigningthe first concrete implementation associated with the data structure, ifthe first set of conditions are met.